A κ-denotational semantics for map theory in ZFC + SI
نویسندگان
چکیده
منابع مشابه
A kappa-Denotational Semantics for Map Theory in ZFC + SI
Map theory, or MT for short, has been designed as an “integrated” foundation for mathematics, logic and computer science. By this we mean that most primitives and tools are designed from the beginning to bear the three intended meanings: logical, computational, and set-theoretic. MT was originally introduced in [18]. It is based on λ-calculus instead of logic and sets, and it fulfills Church’s ...
متن کاملA -denotational semantics for Map Theory in ZFC+ SI
Map theory, or MT for short, has been designed as an \integrated" foundation for mathematics, logic and computer science. By this we mean that most primitives and tools are designed from the beginning to bear the three intended meanings: logical, computational, and set-theoretic. MT was originally introduced in [18]. It is based on -calculus instead of logic and sets, and it ful lls Church's or...
متن کاملDenotational semantics for guarded dependent type theory
We present a new model of Guarded Dependent Type Theory (GDTT), a type theory with guarded recursion and multiple clocks in which one can program with, and reason about coinductive types. Productivity of recursively defined coinductive programs and proofs is encoded in types using guarded recursion, and can therefore be checked modularly, unlike the syntactic checks implemented in modern proof ...
متن کاملA Denotational Semantics for Circus
Circus specifications define both data and behavioural aspects of systems using a combination of Z and CSP. Previously, a denotational semantics has been given to Circus; however, as a shallow embedding of Circus in Z, it was not possible to use it to prove properties like the refinement laws that justify the distinguishing development technique associated with Circus. This work presents a fina...
متن کاملA Denotational Semantics for Curry
We aim to build a denotational semantics for the functional logic programming language Curry, to be used for parametricity and logical relation arguments. First, we investigate only a subset of Curry, but include the important features that separate Curry from a just functional language. We compare a poweralgebraic and a multialgebraic semantic approach and motivate our decision for the multial...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1997
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(96)00302-7